Contrasting Subgroup Discovery
نویسندگان
چکیده
Department of Computer Science and Helsinki Institute for Information Technology HIIT, University of Helsinki, Finland Department of Knowledge Technologies, Jožef Stefan Institute, Ljubljana, Slovenia International Postgraduate School Jožef Stefan, Ljubljana, Slovenia Department of Biotechnology and Systems Biology, National Institute of Biology, Ljubljana, Slovenia Email: {laura.langohr, hannu.toivonen}@cs.helsinki.fi, {vid.podpecan, igor.mozetic, nada.lavrac}@ijs.si, {marko.petek, kristina.gruden}@nib.si
منابع مشابه
CSM-SD: Methodology for contrast set mining through subgroup discovery
This paper addresses a data analysis task, known as contrast set mining, whose goal is to find differences between contrasting groups. As a methodological novelty, it is shown that this task can be effectively solved by transforming it to a more common and well-understood subgroup discovery task. The transformation is studied in two learning settings, a one-versus-all and a pairwise contrast se...
متن کاملSubgroup Discovery – Advanced Review
Subgroup discovery is a broadly applicable descriptive data mining technique for identifying interesting subgroups according to some property of interest. This article summarizes fundamentals of subgroup discovery, before it reviews algorithms and further advanced methodological issues. In addition, we briefly discuss tools and applications of subgroup discovery approaches. In that context, we ...
متن کاملUsing Subgroup Discovery Metrics to Mine Interesting Subgraphs
While extensive work has been done in both graph mining and subgroup discovery, the potential benefits of combining the two fields have not been well studied. We propose, implement, and evaluate an adaption of an existing subgroup discovery algorithm to mine graph data. Our experiments use two different metrics from the subgroup discovery literature to demonstrate value in using such metrics to...
متن کاملAPRIORI-SD: Adapting Association Rule Learning to Subgroup Discovery
& This paper presents a subgroup discovery algorithm APRIORI-SD, developed by adapting association rule learning to subgroup discovery. The paper contributes to subgroup discovery, to a better understanding of the weighted covering algorithm, and the properties of the weighted relative accuracy heuristic by analyzing their performance in the ROC space. An experimental comparison with rule learn...
متن کاملRSD: Relational Subgroup Discovery through First-Order Feature Construction
Relational rule learning is typically used in solving classification and prediction tasks. However, relational rule learning can be adapted also to subgroup discovery. This paper proposes a propositionalization approach to relational subgroup discovery, achieved through appropriately adapting rule learning and first-order feature construction. The proposed approach, applicable to subgroup disco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. J.
دوره 56 شماره
صفحات -
تاریخ انتشار 2013